Complexity of Data Dependence Problems for Program Schemas with Concurrency
نویسندگان
چکیده
منابع مشابه
A Complexity of Data Dependence Problems for Program Schemas with Concurrency
The problem of deciding whether one point in a program is data dependent upon another is fundamental to program analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of terms and predicate symbols, which represent arbitrary predicate functions, are allowed. Given a vertex l in t...
متن کاملOn the computational complexity of dynamic slicing problems for program schemas
On the computational complexity of dynamic slicing problems for program schemas SEBASTIAN DANICIC†§, ROBERT. M. HIERONS‡ and MICHAEL R. LAURENCE† †Department of Computing, Goldsmiths College, University of London, London SE14 6NW, United Kingdom Email: [email protected] ‡Department of Information Systems and Computing, Brunel University, Middlesex, UB8 3PH, United Kingdom Email: rob.hierons@...
متن کاملOn Correct Program Schemas
Extended Abstract 1 Introduction A program schema is an abstraction of a class of actual programs, in the sense that it represents their data-ow and control-ow, but does not contain (all) their actual computations or (all) their actual data structures. Program schemas have been shown to be useful in a variety of applications, such as proving properties of programs, teaching programming to novic...
متن کاملExtended Cyclomatic Complexity Metric for XML Schemas
Extensible Markup Language (XML) plays an extremely important role in the Web application development process. It is a universal format for data and has been adopted for exchanging information among distributed applications. Because XML documents are usually large, it is necessary to find ways to enhance their ease of use and maintainability by keeping their complexity low. In this research, we...
متن کاملComplexity of Decision Problems for XML Schemas and Chain Regular Expressions
We study the complexity of the inclusion, equivalence, and intersection problem for XML schemas occurring in practice. These schemas make use of regular expressions with a very simple structure: they basically consist of the concatenation of factors, where each factor is a disjunction of strings, possibly extended with “∗”, “+”, or “?”. We refer to these as CHAin Regular Expressions (CHAREs). W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computational Logic
سال: 2012
ISSN: 1529-3785,1557-945X
DOI: 10.1145/2159531.2159537